Packet communication system, communication method and program

ABSTRACT

A system including multiple nodes performing radio communication, wherein each node stores routing information, uses it to determine a transmission path, and performs cut-through transmission by transmitting and receiving packets to and from a node on the determined path through transmission and reception radio waves given a directivity by controlling their phases. In the system, time synchronization and transmission and reception of packet communication records are performed during a certain time period by carrying out the cut-through transmission while controlling phases of the radio waves so that all of the nodes form one or more closed loops. The node transmits and receives packets in accordance with routing information and a time frame assigned to each of the nodes as a time when each node is allowed to transmit and receive a packet, updates the routing information, and shares it with each node.

CROSS REFERENCE TO RELATED APPLICATION

This application claims priority under 35 U.S.C. 119 from JapaneseApplication 2009-271997, filed Nov. 30, 2009, the entire contents ofwhich are incorporated herein by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a packet communication system that usesbeam forming and enables transmission and reception of multiple packetsexclusively in time and space, and relates to a communication method forthe packet communication system, and a program readable by the packetcommunication system for executing the method.

2. Description of Related Art

In recent years, use of beam forming has gradually increased in radiocommunication systems using radio waves. Beam forming is a technique forreducing radio wave interference between base stations and terminals sothat the radio wave can be transmitted for a longer distance (forexample, see International Publication No. WO/02/052748). Use of thistechnique enables propagation of electromagnetic wave energy with acertain directivity, so that transmission distance, space utilizationefficiency, power efficiency and the like can be enhanced.

Beam forming is achieved by combining two techniques: null steering andbeam steering. Null steering is a technique for preventing a basestation from transmitting and receiving a radio wave in and from adirection where another base station interfering with the first basestation exists. Beam steering is a technique for intensely transmittinga radio wave of a base station in a specific direction.

In null steering, an antenna including multiple antenna elementsarranged in a certain order is used to give a certain directivity to aradio wave, so that radio waves can be transmitted and received withoutinterfering with those transmitted from other base stations orterminals. Meanwhile, in beam steering, a radio wave can be transmittedintensely by varying the phase and power of each of the signalstransmitted from multiple antenna elements.

However, in a system where communications are made by use of beamforming, a problem exists of how to perform efficient synchronizationand broadcasting among individual transceivers.

Since data is exchanged by synchronizing a data signal and a local clocksignal, transceivers which are to exchange the data need to operate atthe same clock speed. In a case of transmitting a packet to adestination address through multiple transceivers, all of thetransceivers need to operate at the same clock speed. To make all of thetransceivers operate at the same clock, synchronization signals aretransmitted to the transceivers, so that each of the transceivers mayuse the synchronization signal to synchronize with the local clocksignal for reading data. Generally, synchronization signals can betransmitted efficiently by broadcasting. However, in communication byuse of beam forming, synchronization signals cannot be transmittedefficiently because radio waves are given a certain directivity and aretransmitted only to specific transceivers.

Moreover, each transceiver transmits a broadcast signal to anunspecified number of transceivers, acquires address information,routing information, channel information and the like of communicabletransceivers by receiving responses from the transceivers, and storesthe acquired information. The address information includes a MAC addressor an IP address, the routing information includes a routing tablerecording optimal routes to various destinations, and the channelinformation includes a frequency band. Each transceiver is capable ofperiodically transmitting the broadcast signal to acquire informationthat the transceiver does not store therein, and use the new informationto update information stored therein. However, in communication by useof beam forming, broadcast signals cannot be transmitted efficiently assimilar to the above case.

Against this background, there is a method in which a master controlleris used to schedule all communications with all devices, and distributesynchronization signals and broadcast signals to individual devices (forexample, see Japanese Patent Application Publication No. 2008-061256).However, with this method, if the number of devices increases, overheadis increased proportionally to the number of devices. Moreover, everydevice needs to communicate with the master controller, and thusarrangement of the devices is restricted.

There is also a method for stopping the beam forming duringsynchronization and broadcasting. In this method, the synchronizationand broadcasting can be performed efficiently since radio waves do nothave directivity. However, the transmission distance of a signal isshortened in this method, or the data rate needs to be lowered in orderto keep the same transmission distance, as in the case of using the beamforming technique.

BRIEF SUMMARY OF THE INVENTION

To overcome these deficiencies, the present invention provides a packetcommunication system for transferring a packet to a destination address,including: a plurality of nodes performing radio communication, whereineach of the nodes: stores routing information for determining atransmission path of the packet, transmits and receives the packets to atransfer destination node and from a transfer source node on atransmission path determined by use of the routing information, throughtransmission and reception radio waves each of which is given a certaindirectivity by controlling a phase of the radio wave, and has a functionof performing a cut-through transmission in which transfer of the packetto the transfer destination node is initiated after reading of adestination address included in the packet and before reception of thepacket is completed, and wherein the packet communication system:performs time synchronization and transmission and reception of packetcommunication records during a certain time period by carrying out thecut-through transmission, while controlling the phases of thetransmission and reception radio waves so that all of the nodes form oneor more closed loops, and transfers the packet to the destinationaddress at a time other than the certain time period in accordance withthe routing information and a time frame assigned to each of the nodesas a time when each node is allowed to transmit and receive a packet,updates the routing information held by each node on the basis of thepacket communication records, and shares the updated routing informationamong the nodes after the time synchronization.

In another aspect, the present invention provides a communication methodin a packet communication system, including a plurality of nodesperforming radio communication, for transferring a packet to adestination address, the communication method including: storing, ineach of the nodes, routing information for determining a transmissionpath of the packet; transmitting and receiving the packets, by each ofthe nodes, to a transfer destination node and from a transfer sourcenode on a transmission path determined by use of the routinginformation, through transmission and reception radio waves each ofwhich is given a certain directivity by controlling a phase of the radiowave; performing, by each of the nodes, a cut-through transmission inwhich transfer of the packet to the transfer destination node isinitiated after reading of a destination address included in the packetand before reception of the packet is completed; performing timesynchronization and transmission and reception of packet communicationrecords during a certain time period by carrying out the cut-throughtransmission, while controlling the phases of the transmission andreception radio waves so that all of the nodes form one or more closedloops; transferring the packet to the destination address at a timeother than the certain time period in accordance with the routinginformation and a time frame assigned to each of the nodes as a timewhen each node is allowed to transmit and receive a packet; updating therouting information held by each node on the basis of the packetcommunication records; and sharing the updated routing information amongthe nodes after the time synchronization.

In yet another aspect, the present invention provides a computer programproduct for executing a communication method for transferring a packetto a destination address, the program being readable by a packetcommunication system including a plurality of nodes performing radiocommunication, the computer program product including a computerreadable storage medium having computer readable program code embodiedtherewith, the computer readable program code including computerreadable program code configured to: store in each of the nodes routinginformation for determining a transmission path of a packet; transmitand receive packets to and from a transfer destination and a transfersource node on the transmission path determined by use of the routinginformation, the transmission and reception being performed bycontrolling phases of transmission and reception radio waves and givingthe radio waves a certain directivity; perform cut-through transmissionin each of the nodes in which transfer of the packet to the transferdestination node is initiated after reading a destination addressincluded in the packet and before reception of the packet is completed;perform time synchronization and transmission and reception of packetcommunication records during a certain time period by carrying out thecut-through transmission, while controlling the phases of thetransmission and reception radio waves so that all of the nodes form oneor more closed loops; and transfer the packet to the destination addressat a time other than the certain time period in accordance with therouting information and a time frame assigned to each of the nodes as atime when each node is allowed to transmit and receive a packet, updatethe routing information held by each node on the basis of the packetcommunication records and share the updated routing information amongthe nodes after the time synchronization.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 is a diagram showing a configuration example of a packetcommunication system configured of multiple nodes.

FIG. 2 is a diagram showing an example of an antenna configured ofmultiple antenna elements included in a node.

FIG. 3 is a diagram showing a state in which a closed loop is formed inthe packet communication system.

FIG. 4 is a diagram exemplifying a state in which time synchronizationand broadcasting are performed.

FIG. 5 is a diagram exemplifying the state in which the timesynchronization and the broadcasting are performed.

FIG. 6 is a diagram exemplifying the state in which the timesynchronization and the broadcasting are performed.

FIG. 7 is a flowchart showing a flow of time synchronization andbroadcasting.

FIG. 8 is a diagram exemplifying an arrangement of multiple nodescommunicating with each other.

FIG. 9 is a table exemplifying a throughput table in which inter-nodedata transfer rates are recorded.

FIG. 10 is a table exemplifying a demand table in which inter-node datatransfer amounts predicted from packet communication records arerecorded.

FIG. 11 is a table exemplifying a routing table generated on the basisof the throughput table shown in FIG. 9 and the demand table shown inFIG. 10.

FIG. 12 is a table exemplifying an allocation table.

FIG. 13 is a flowchart showing a flow of packet transfer processing.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

An embodiment of the invention provides a system and a method whichenable efficient synchronization and broadcasting without using a mastercontroller in a system where communication is made by use of beamforming, and which also enable efficient transmission and reception ofmultiple packets exclusively in time and space.

Although the invention will be described below in relation to a concreteembodiment shown in the drawings, the invention is not limited to thefollowing embodiment. FIG. 1 is a diagram exemplifying a configurationof a packet communication system of an embodiment of the invention. Thispacket communication system is configured of multiple radio transceiverswhich are referred to as nodes 100 to 190. Each of nodes 100 to 190 isconfigured to include an antenna 200, an RF transceiver circuit 210 anda base band digital control circuit 220. The antenna 200 is configuredof multiple antenna elements arranged in a certain order. The RFtransceiver circuit 210 serves as a phase control means capable ofcontrolling phases of radio waves which specify the direction oftransmission and reception radio waves of each antenna element. The baseband digital control circuit 220 serves as a transmission and receptionmeans configured to perform processing, such as packet transmission andreception.

The nodes 100 to 190 are located away from each other, and are capableof performing packet communication among one another by use of radiowaves. The antenna 200 is a device which transmits electrical energy asa radio wave, and receives a radio wave in the air to convert it intoelectrical energy. A simple example of the antenna 200 is that in whichmultiple rod antenna elements are arranged in a certain order.

For example, as shown in FIG. 2, the antenna 200 can be configured sothat two of rod antenna elements 201 are aligned vertically, the totallength L thereof is set to be equal to a half-wavelength of a radiowave, and pairs of the antenna elements 201 are arranged at a certainpitch such as a pitch W which is approximately a quarter of a wavelengthto a single wavelength, for example. A feeder line 202 is connected toeach of the antenna elements 201, so that electric power can betransmitted through the feeder line 202.

Referring back to FIG. 1, the RF transceiver circuit 210 is connected tothe feeder lines 202 and controls the phases that specify the directionof radio waves transmitted and received by each antenna element 201.Specifically, since the antenna 200 is configured of multiple antennaelements 201, the RF transceiver circuit 210 converts a destinationaddress included in a packet into a phase difference of a radio wavewhich should be applied to each of the antenna elements 201 included inthe transfer destination node. While the RF transceiver circuit 210 iscapable of transmitting a radio wave in a specific direction bycontrolling the phase of the radio wave, the antenna 200 is configuredof multiple antenna elements 201 which are located at differentpositions in the antenna 200. Hence, in order for appropriate receptionin each antenna element 201, the direction of a radio wave that shouldbe transmitted to each antenna element 201 is converted into a phasedifference relative to a specific direction. By performing such phasecontrol, a certain directivity is given to a radio wave, whereby theradio wave is transmitted in a specific direction and thus beam formingcan be achieved.

The base band digital control circuit 220 performs processing such aspacket transmission and reception. The base band digital control circuit220 can be a large-scale integration (LSI) which implements functions ofa media access control (MAC) layer and a physical (PHY) layer, and onwhich a digital-analogue converter (DAC), an analogue-digital converter(ADC), a CPU, a static RAM (SRAM) and the like are mounted.

The base band digital control circuit 220 is connected with anunillustrated host CPU and exchanges transmission and reception datawith the host CPU. The base band digital control circuit 220 has apacket assembly/disassembly (PAD) mounted thereon, and is capable ofconverting data received from the host CPU into a packet, storing it ina storage device such as an SRAM, and transmitting the packet when arelay transmission path is available. The base band digital controlcircuit 220 having a PAD mounted thereon is also capable of storing areceived packet in a storage device, converting the stored packet intodata and transmitting the data to the host CPU. Note that the host CPUsets a destination address and performs processing such as transmissionof data to the base band digital control circuit 220.

As shown in FIG. 1, the nodes 100 to 190 are located away from eachother. In one embodiment, for example, if the nodes 100 to 140 on theupper side of FIG. 1 are caused to function as transmitters, the nodes150 to 190 on the lower side are caused to function as receivers,whereby node pairs are formed. Otherwise, each of the nodes 100 to 190may have a transmission antenna and a reception antenna so that eachnode may perform both transmission and reception.

Generally, at a time of low congestion when only few radio waves aretransmitted and received, packets transmitted by the radio waves are notlikely to collide with each other, and performance is minimallydeteriorated by collisions. However, it becomes important to avoid acollision when the number of packets increases. Here, a collision occurswhen two or more nodes simultaneously initiate transmission of a packetto the same node. When packets collide, the two or more packets overlapeach other, and the packets become unreadable. At a time of highcongestion when many radio waves are transmitted and received, thepossibility of a collision increases, and system performance is greatlydeteriorated.

However, the packet communication system of the embodiment of theinvention avoids a collision and achieves efficient communication byenabling temporally and spatially exclusive control, that is, byenabling communication exclusively in time and space. Specific controloperations will be described below in detail.

Nodes communicate by exchanging packets. A packet includes a destinationaddress. In order to transmit the packet to the destination address, thebase band digital control circuit 220 refers to a routing table, whichis routing information for determining a transfer route of the packet,and determines the node through which to transmit the packet to thedestination. Then, the RF transceiver circuit 210 controls the phase tobe applied to the antenna 200 of the first node, and the base banddigital control circuit 220 transmits the packet by a radio wave. Thisradio wave is controlled to have a certain directivity to allowspatially exclusive communication. Note that the routing table is heldby each of the nodes 100 to 190, and is stored in a storage device suchas an SRAM.

When the first node receives the packet, the node reads the destinationaddress, refers to the routing table, determines the next node andtransfers the packet to the next node. In this respect, each of thenodes 100 to 190 holds address information of communicable nodes andchannel information used in communication, and uses the addressinformation and the channel information to transfer the packet. Hence,the packet can be transmitted to the destination by being transferredwith reference to the routing table.

If two nodes receive packets at the same time and transmit the packetsto the same node, the aforementioned collision occurs. For this reason,adjustment needs to be made to vary the transmission timings thereof.The adjustment is made by transmitting a packet communication record toother nodes, such as an inter-node transfer rate and an amount ofpreviously transferred data, and acquiring packet communication recordsfrom other nodes to share information. Then, routing is performed toavoid a collision on the basis of predictions made from thecommunication records.

To adjust the transmission timings of packets, time synchronizationneeds to be performed for each node. Accordingly, each node transmits abroadcast signal for sharing information and a synchronization signal toother nodes, and performs time synchronization as well as acquiresinformation from other nodes.

In communication using beam forming, a radio wave is given a certaindirectivity, whereby the transmission distance thereof is made longerwith the same amount of electric power. Since other space can be usedfor transmission of other radio waves, space utilization efficiency canbe improved. This, in turn allows transmission with a small amount ofelectric power which leads to improvement in power efficiency. However,each node needs to transmit signals to other nodes by use of radio wavesin different directions to perform time synchronization and shareinformation among the nodes, which lowers efficiency and requires aconsiderable amount of time in the time synchronization and informationsharing.

Hence, in the present embodiment of the invention, all the nodes 100 to190 control phases of radio waves in a predetermined time period so asto form a closed loop (closed transmission path), and performs the timesynchronization and information sharing efficiently by use ofcut-through transmission. As for the predetermined time period, a periodin which time synchronization and information sharing are performed, therouting table is updated, and a later-described assignment table isgenerated can be measured and set as the predetermined time period.

The closed loop can be formed by causing each of the nodes 100 to 190 tocontrol the phase to specify the direction of a radio wave to betransmitted. Specifically, on the assumption that each node isconfigured to have a transmission antenna and a reception antenna, radiowaves are transmitted in the order of the nodes 100, 150, 110, 170, 130,190, 140, 180, 120, 160 and 100 as indicated by the arrows in FIG. 3. Toform the closed loop, the node 100, for example, controls a phase totransmit a radio wave to the node 150, and controls a phase to receive aradio wave from the node 160. The closed loop also can be formed inaccordance with closed loop information set in advance.

The synchronization signal and the broadcast signal can be transmittedas packets. A packet is obtained by dividing information into small datapieces, and a destination address, a source address, and controlinformation such as a packet type and length are added to a part of eachof the small data pieces.

More specifically, a packet includes at its beginning a preamble formedof a bit string, which is transmitted prior to the data to announce aninitiation of communication. The preamble is followed by an SOF (Startof Frame) indicating the beginning of the packet, a destination address,a source address, a type, length and the like of the packet, and thendata. Generally, when a node starts reception of a packet, the packet istransmitted to the base band digital control circuit 220 which performsprocessing of the transmission and reception of packets. Normally, thenode does not transfer the packet to the next node determined by routinguntil it completes reception of the data. This configuration requires along time for transmitting the packet to the destination address.

Thus, the present embodiment of the invention employs cut-throughtransmission, in which each node performs, before the completion of thereception of data, routing in accordance with the destination addressincluded in the packet; then it sequentially transfers data received andaccumulated in a buffer from its beginning to the next node determinedby the routing. Hence, the time synchronization and information sharingcan be performed efficiently by employing the cut-through transmission.In order to do this, upon reading the destination address in the packet,the RF transceiver circuit 210 converts, before completion of receptionof the packet, the destination address into a phase difference of aradio wave to be applied to each antenna element included in thedestination node.

A detailed description will be given of a method for efficientlyperforming time synchronization and information sharing, with referenceto a flowchart shown in FIG. 7 and a system configuration diagramincluding six nodes shown in FIGS. 4 to 6, although the systemconfiguration is different from that shown in FIGS. 1 and 3. For ease ofunderstanding, in FIGS. 4 to 6, six nodes 100 to 150 are arranged toform a regular hexagon. Here, for example, the node 100 controls phasesto transmit and receive radio waves so as to transmit a packet to thenode 110 and receive a packet from the node 150.

For example, any one of the nodes 100 to 150 initiates timesynchronization and information sharing by performing, at predeterminedintervals, broadcasting for the time synchronization and informationsharing by transmitting a packet including a preamble, an SOF, adestination address, a source address, a type, length and the like ofthe packet, data and so forth. A broadcast address is used as thedestination address for the packet to transmit data to all of the nodes.Note that since it is difficult to carry out the time synchronizationand information sharing when a node is busy, the processing therefore isnot limited to being performed at predetermined regular intervals, butcan be performed at irregular intervals.

For example, the node 100 determines whether a predetermined time haspassed since the last time the time synchronization and informationsharing have been initiated. If so, the node 100 initiates timesynchronization and information sharing by controlling a phase of aradio wave and transmitting the aforementioned packet to the node 110which is routed in advance. Upon receipt of the packet, the node 110performs synchronization by use of the preamble, detects the beginningof the packet by the SOF, and from the type of the packet and becausethe broadcast address is the destination address is notified that thetime synchronization and information sharing are to be performed.Accordingly, the node 110 generates a packet by including informationheld therein as data and using the broadcast address as the destinationaddress. Then, the node 110 controls a phase of a radio wave andtransmits the packet to the node 120 which is routed in advance. At thistime, the node 110 performs cut-through transmission and transmits thepacket to the node 120 before receiving the entire packet from the node100.

Thus, each of the nodes 100 to 150 controls a phase of a radio wavetoward a specific destination, transmits a packet including a preamble,an SOF, a destination address, a source address, a type and length ofthe packet, and a packet communication record as data, and receives aradio wave from a specific source. It should be noted that onlypreambles, SOFs and data are shown in FIGS. 4 to 6. Each of the nodes100 to 150 performs synchronization by use of the preamble, receives apacket from a specific source and generates a packet to transmit to adestination node by adding data acquired from the source node, which isincluded in the packet, to data of its own.

Packets shown in FIG. 5 are packets to be transmitted next, and in apacket to be transmitted from the node 100 to the node 110, for example,data 6 acquired from the node 150 is added to data 1 of the node 100.Hence, by repeating the processing of generating a packet by addingacquired data in this manner and of transmitting the resultant packet,time synchronization can be performed among all of the nodes 100 to 150,and each of the nodes 100 to 150 can acquire all of the pieces of data 1to 6 of the respective nodes 100 to 150 as shown in FIG. 6.

Specifically, as shown in FIG. 7, in the processing starting from stepS700, any predetermined node such as the node 100 generates a packet byincluding its packet communication record as data and setting abroadcast address as a destination address, controls a phase of a radiowave to transmit the packet to the node 110 routed in advance, andthereby initiates time synchronization and information sharing in stepS705. Then, in step S710, a closed loop is formed by causing a packet tobe transmitted sequentially among the nodes 100 to 150 in an orderdetermined in advance by routing such as from the node 110 to 120, andthen from the node 120 to 130. Here, each node controls a phase of aradio wave to communicate with a specific node, and also receives aradio wave from a specific source. The packet includes a preamble, anSOF, a destination address, a source address, a type and length of thepacket, and a packet communication record as data.

In addition, in another embodiment, a more efficient cut-throughtransmission can be performed in the following manner. Specifically,after the processing starts in step S700, the node 110, for example,initiates transmission of its own information to the node 120 being thenext stage which is defined in advance by routing in the closed loop,before receiving a packet from the node 100 being the previous stage.Then, upon receipt of data from the node 100 being the previous stage,the node 110 adds, without including a preamble, the data of the packetreceived from the node 100 being the previous stage to the packet thatthe node 110 is currently transmitting to the node 120 being the nextstage. Employment of such a scheme reduces time required forsynchronization of preambles and time required for sharing informationamong all nodes in the closed loop, since all the nodes can initiatetransmission at the same time.

In step S715, each of the nodes 100 to 150 generates a packet by addinginformation acquired from a source to its own information, and transmitsthe packet to a destination node. In step S720, the node 100 which hasinitiated the time synchronization and information sharing determineswhether it has acquired information from all of the nodes 100 to 150. Ifnot, the processing returns to step S715. On the other hand, ifinformation is acquired from all the nodes 100 to 150, the processingproceeds to step S725, and the time synchronization and informationsharing are terminated.

Thereafter, the node 100 updates a routing table held therein on thebasis of acquired data and transmits the routing table to the nodes 110to 150, whereby each of the nodes 110 to 150 may update a routing tableheld therein.

Although a routing table can be formed manually and statically in asmall network, in a general network, a routing table is formeddynamically by use of a routing protocol and a routing algorithm. Therouting protocol is used to perform broadcasting so that each of thenodes 100 to 150 may acquire a packet communication record from theother nodes as information thereof. The routing algorithm is used at thetime of generating a routing table based on the acquired information.Known techniques such as the distance vector algorithm (DVA), the linkstate algorithm (LSA) and the simplex method can be used as the routingalgorithm.

In the DVA, a numeric value called a cost is assigned to each pair ofnodes. In the beginning, each node only holds information indicatingwhich are the nearest nodes and costs between itself and the nearestnodes. Then, after periodically exchanging information among the nodes,pieces of information among other nodes are collected, which are formedinto a routing table. If data forwarded from a neighboring node includesinformation which is not included in the routing table held by the node,and which indicates a lower cost to the same destination, the nodeupdates the table by use of this piece of information.

In the LSA, each of the nodes broadcasts nodes connected thereto. Thenode generates a map based on the broadcasted data, determines theshortest paths to the other nodes in accordance with the generated map,and expresses the whole network in a tree structure. Unregistered nodesare added to the tree structure so as to be reachable at the lowestcost. A routing table is generated on the basis of the thus generatedtree structure.

Routing can be formulated as a linear programming problem. An optimalsolution for a given linear programming problem can be obtained with arelatively small amount of calculation by use of the simplex method. Informulating the linear programming problem, direct transfer rates andpredicted data transfer amounts among nodes are given as inputs, andminimization of the upper limit of utilization rate of eachcommunication path is given as an objective function. Further,constraints are given that a total of amount of data transferred at thestart point, the end point, and relay nodes coincide with a given input;and that the utilization rate of each communication path is not higherthan the upper limit.

Note that a cost is obtained in accordance with a transfer rate, a datatransfer amount, a delay, the number of hops, a cost of a path, a load,an MTU, reliability, a communication cost and the like.

In this embodiment, processing for the time synchronization andinformation sharing are efficiently performed by employing cut-throughtransmission to transmit packets to the next node. Arbitrarytransmission packets are transmitted and received after the timesynchronization, and broadcasting is thus performed and the routingtable is updated.

The arbitrary packet is routed in accordance with a destination addressand the updated routing table, and is transmitted to the destinationaddress via the nodes determined in the routing.

At this time, the timing at which each node transmits the arbitrarypacket needs to be considered in order to avoid a collision. Hence, thetime period for using a band is equally divided into time frames calledslots, and a node is assigned a communication opportunity for each slot.Then, the slots collectively form a period called a frame, and anassignment table is formed so that all of the nodes transmit packetsperiodically. The table is generated on the basis of informationacquired from each node, and the transmission timings can be determinedby use of this assignment table.

Since a collision is not likely to occur in a slot whose utilizationrate is not higher than a certain value, collisions can be allowed insuch a slot by not assigning a communication opportunity for the slot toany specific node. A slot for which no communication opportunity isassigned is usable by any node at any time, and thus wait time beforeusing the slot can be reduced, while throughput is degraded due tooccurrence of collisions. To what extent to allow collisions needs to bedetermined in consideration of the trade-off between wait time andthroughput.

FIG. 8 exemplifies a system configured of six nodes as in the systemshown in FIGS. 4 to 6, and each node has a certain directivity whichallows communication with specific nodes. Node A is communicable withnodes B and F, node B is communicable with nodes A, C and E, node C iscommunicable with nodes B, D and F, node D is communicable with nodes Cand E, node E is communicable with nodes B, D and F, and node F iscommunicable with nodes A, C and E.

The directivity is determined in accordance with a throughput tableshown in FIG. 9 which indicates inter-node transfer rates. Thethroughput table is generated by inputting transfer rates obtained fromcommunication tests which are performed at the time of locating thenodes A to F. In the table, “Sender” indicates the transmitting side and“Receiver” indicates the receiving side. In FIG. 9, all of the transferrates between communicable nodes are set to “100.” Each of the setvalues of the transfer rates inputted to the throughput table can bechanged as appropriate by measuring the transfer rate in actualcommunication. The nodes A to F may hold throughput tables of the samecontents, and when a change is made to a throughput table of any of thenodes, the other nodes can be notified of the change to shareinformation.

Each of the nodes A to F periodically measures an inter-node datatransfer amount, and records the data transfer amount as a record. Therecorded record is transmitted at the time of information sharingdescribed above, and the information is shared among all nodes. Forexample, a node that updates a routing table generates a demand table asshown in FIG. 10 by use of the measured values and the like of the datatransfer amounts. Note that in FIG. 10, “Sender” indicates thetransmission source and “Receiver” indicates the transmissiondestination.

A demand table includes, as set values, data transfer amounts predictedfrom the latest measured values and the like, and is used, together withthe above throughput table, to generate a routing table and anassignment table.

FIG. 11 is a table showing an example of a routing table generated byuse of the tables shown in FIGS. 9 and 10. For example, in packetcommunication where node A shown in FIG. 8 is the sender and node B isthe receiver, a packet can be transmitted without passing throughanother node, and thus node B is set as the destination. Thus, in nodeswhich can directly transmit and receive packets to and from each other,any of the nodes is set as the destination.

Meanwhile, in packet communication where node A is the sender and node Cis the receiver, a packet cannot be transmitted without passing throughnode B or node F. Accordingly, optimization is performed by use of theinformation in the tables shown in FIGS. 9 and 10 and a known algorithm,to thereby determine the destination.

In the above example, as a result of the optimization, it is determinedto be more efficient to transmit the packet through node B. Hence, whena packet is to be transmitted from the source node A to the destinationnode C, routing is performed so that node A firstly transmits the packetto node B, and then node B transmits the packet to node C.

FIG. 12 is a table showing an example of an assignment table. In FIG.12, eight time sections of slots 0 to 7 having equal lengths areprovided, in which the receiver node A can receive packets from node Bin slots 1 and 2, and the receiver node C can receive packets from nodeB in slots 0 to 3.

By thus avoiding a collision in terms of time as well, packets can betransmitted and received exclusively in time and space.

Hereinbelow, a flow of processing in the packet communication system ofan embodiment of the invention will be described briefly with referenceto FIG. 13. After the processing starts in step S1300, in step S1305, itis determined whether a predetermined time has passed since the lasttime the time synchronization and information sharing have beeninitiated. If not, the determination in step S1305 is made after thepredetermined time further elapses.

On the other hand, if it is determined that the predetermined time haspassed, the processing proceeds to step S1310 and the timesynchronization and information sharing shown in FIG. 7 are performed.Then, the processing proceeds to step S1315, in which a predeterminednode updates a routing table in accordance with a packet communicationrecord acquired by information sharing, the packet communication recordincluding the aforementioned transfer rate and data transfer amount. Thepredetermined node further generates an assignment table by assigning tothe nodes, packet transmittable and receivable slots.

In step S1320, the predetermined node transmits the routing table andthe assignment table to all of the other nodes to share the tables.

Subsequently in step S1325, it is determined whether a predeterminedtime has passed. If not, the processing proceeds to step S1330 in whichtransfer of the packet is suspended. After the predetermined timepasses, the processing proceeds to step S1335. Here, if there is atransmission packet in an arbitrary node, the updated routing table isused to transfer the packet to the destination address in a slotspecified in the assignment table, and the processing is terminated instep S1340.

The arbitrary node reads a destination address from the transmissionpacket, performs routing in accordance with the routing table todetermine the next node, controls a phase of the radio wave toward thenext node, and transmits the packet in the transmittable time frame.This next node performs the same processing, and the processing isrepeated until the packet is transferred to the destination address.

Since nodes can be controlled to dynamically construct communicationpaths, the system of the present embodiment of the invention can beprovided as a cross bar switch in which switches are provided atrespective intersections between multiple communication paths arrangedin parallel in the vertical direction and multiple communication pathsarranged in parallel in the horizontal direction. The cross bar switchcan be applied to a millimeter wave server system or the like to achievea hubless or cableless computing environment. Consequently, serverinstallation cost can be reduced, and data can be downloadedinstantaneously.

The packet communication system of the present embodiment of theinvention is not limited to that configured only of multiple wirelessnodes performing radio communication, but can be configured by combiningthese multiple wireless nodes with multiple wired nodes mutuallyconnected via a cable. A phase of a radio wave need not be controlledamong the wired nodes, and a packet can be transmitted to a target nodeby specifying the destination address. Since each node holds addressinformation of communicable nodes and channel information used incommunication, and routing information is integrally managed while beingupdated as appropriate, the system as a whole can be optimized.

Hereinabove, the packet communication system and a communication methodapplied thereto have been described in detail with reference to thedrawings. However, other embodiments, additions, modifications,omissions and the like can be made within the scope conceivable by thoseskilled in the art, and any embodiment including advantageous effects ofthis invention should be included within the scope of the presentinvention. Accordingly, although only the updating of routinginformation has been described above, if an address or a channel is tobe changed due to traveling of a node or the like, address informationor channel information can be updated likewise.

In addition, time synchronization and information sharing can beperformed by forming multiple closed loops instead of a single loop, inconsideration of the arrangement and number of nodes. In this case,efficiency can be improved in packet communication among nodes formingeach closed loop, which enables efficient packet communication in thesystem as a whole.

Moreover, the communication method can be implemented as a programreadable by a packet communication system, and the present invention isalso capable of providing this program. Note that the program can beprovided by being stored in a recording medium such as a CD-ROM, aDVD-ROM, an SD card and an HDD.

What is claimed is:
 1. A packet communication system for transferring apacket to a destination address, the system comprising: a plurality ofnodes performing radio communication, wherein each of the said nodes:stores therein routing information for determining a transmission pathof said packet, transmits and receives said packets to a transferdestination node and from a transfer source node on a transmission pathdetermined by use of said routing information, through transmission andreception radio waves each of which is given a certain directivity bycontrolling a phase of said radio wave, and has a function of performinga cut-through transmission in which transfer of said packet to saidtransfer destination node is initiated after reading of a destinationaddress included in said packet and before reception of said packet iscompleted, and wherein said packet communication system: performs timesynchronization and transmission and reception of packet communicationrecords during a certain time period by carrying out said cut-throughtransmission, while controlling said phases of said transmission andreception radio waves so that all of the said nodes form one or moreclosed loops, and transfers said packet to said destination address at atime other than said certain time period in accordance with said routinginformation and a time frame assigned to each of the said nodes as atime when each said node is allowed to transmit and receive a packet,updates said routing information held by each said node on the basis ofsaid packet communication records, and shares said updated routinginformation among said nodes after said time synchronization; wherein:said node comprises an antenna formed of a plurality of antenna elementsarranged in a certain order, phase control means for controlling saidphases of said transmission and reception radio waves of each of thesaid antenna elements, and transmission and reception means fortransmitting and receiving said packet through said transmission andreception radio waves, and said phase control means converts saiddestination address included in said packet into a phase difference of aradio wave to be applied to each of the said antenna elements includedin said transfer destination node.
 2. The packet communication systemaccording to claim 1, wherein: said node comprises an antenna formed ofa plurality of antenna elements arranged in a certain order, phasecontrol means for controlling said phases of said transmission andreception radio waves of each of the said antenna elements, andtransmission and reception means for transmitting and receiving saidpacket through said transmission and reception radio waves, and saidphase control means, after reading said destination address included insaid packet and before reception of said packet is completed, convertssaid destination address included in said packet into a phase differenceof a radio wave to be applied to each of the said antenna elementsincluded in said transfer destination node.
 3. The packet communicationsystem according to claim 1, wherein said time synchronization and saidtransmission and reception of said packet communication records areperformed at predetermined intervals.
 4. The packet communication systemaccording to claim 1, wherein said time synchronization and saidtransmission and reception of said packet communication records areinitiated by transferring an initiation request made by one of the saidplurality of nodes among said other nodes sequentially from one toanother.
 5. The packet communication system according to claim 1,wherein said packet communication records each include a transfer rateand a data transfer amount between said nodes.
 6. The packetcommunication system according to claim 1, wherein each of the saidnodes further stores therein address information of communicable nodesand channel information used for communication.
 7. The packetcommunication system according to claim 1, wherein said packetcommunication system comprises a plurality of wireless nodes performingsaid radio communication and a plurality of wired nodes mutuallyconnected via a cable.
 8. A communication method in a packetcommunication system, including a plurality of nodes performing radiocommunication, for transferring a packet to a destination address, thecommunication method comprising: storing, in each of the said nodes,routing information for determining a transmission path of said packet;transmitting and receiving said packets, by each of the said nodes, to atransfer destination node and from a transfer source node on atransmission path determined by use of said routing information, throughtransmission and reception radio waves each of which is given a certaindirectivity by controlling a phase of said radio wave; performing, byeach of the said nodes, a cut-through transmission in which transfer ofsaid packet to said transfer destination node is initiated after readingof a destination address included in said packet and before reception ofsaid packet is completed; performing time synchronization andtransmission and reception of packet communication records during acertain time period by carrying out said cut-through transmission, whilecontrolling said phases of said transmission and reception radio wavesso that all of the said nodes form one or more closed loops;transferring said packet to said destination address at a time otherthan said certain time period in accordance with said routinginformation and a time frame assigned to each of the said nodes as atime when each said node is allowed to transmit and receive a packet;updating said routing information held by each said node on the basis ofsaid packet communication records; and sharing said updated routinginformation among said nodes after said time synchronization; wherein:said node comprises an antenna formed of a plurality of antenna elementsarranged in a certain order, phase control means for controlling saidphases of said transmission and reception radio waves of each of thesaid antenna elements, and transmission and reception means fortransmitting and receiving said packet through said transmission andreception radio waves, and said phase control means converts saiddestination address included in said packet into a phase difference of aradio wave to be applied to each of the said antenna elements includedin said transfer destination node.
 9. The communication method accordingto claim 8, wherein performing transmission and reception of packetcommunication records further comprises determining whether said packetcommunication records have been acquired from all of the nodes.
 10. Thecommunication method according to claim 8, wherein: said node includesan antenna formed of a plurality of antenna elements arranged in acertain order, phase control means for controlling phases of saidtransmission and reception radio waves of each of the said antennaelements, and transmission and reception means for transmitting andreceiving said packet through said transmission and reception radiowaves, and transmitting and receiving said packets further comprisesconverting, by said phase control means, said destination addressincluded in said packet into a phase difference to be applied to each ofthe said antenna elements included in said transfer destination node.11. The communication method according to claim 8, wherein: said nodeincludes an antenna formed of a plurality of antenna elements arrangedin a certain order, phase control means for controlling phases of saidtransmission and reception radio waves of each of the said antennaelements, and transmission and reception means for transmitting andreceiving said packet through said transmission and reception radiowaves, and transmitting and receiving said packets, after reading saiddestination address included in said packet and before reception of saidpacket is completed, further comprises converting, by said phase controlmeans, said destination address included in said packet into a phasedifference to be applied to each of the said antenna elements includedin said transfer destination node.
 12. The communication methodaccording to claim 8, wherein performing transmission and reception ofpacket communication records is executed at predetermined intervals. 13.The communication method according to claim 8, wherein performingtransmission and reception of packet communication records furthercomprises initiating said time synchronization and said transmission andreception of said packet communication records by transferring aninitiation request made by one of the said plurality of nodes, amongsaid other nodes sequentially from one to another.
 14. The packetcommunication system according to claim 8, wherein said packetcommunication records each include a transfer rate and a data transferamount between said nodes.
 15. The packet communication system accordingto claim 8, wherein each of the said nodes further stores thereinaddress information of communicable nodes and channel information usedfor communication.
 16. A computer program product for executing acommunication method for transferring a packet to a destination address,the program being readable by a packet communication system including aplurality of nodes performing radio communication, the computer programproduct comprising: a non-transitory computer readable storage mediumhaving computer readable program code embodied therewith, the computerreadable program code comprising: computer readable program codeconfigured to: store in each of the said nodes routing information fordetermining a transmission path of a packet; transmit and receivepackets to and from a transfer destination and a transfer source node onthe transmission path determined by use of said routing information,said transmission and reception being performed by controlling phases oftransmission and reception radio waves and giving the radio waves acertain directivity; perform cut-through transmission in each of thesaid nodes in which transfer of said packet to said transfer destinationnode is initiated after reading a destination address included in saidpacket and before reception of said packet is completed; perform timesynchronization and transmission and reception of packet communicationrecords during a certain time period by carrying out said cut-throughtransmission, while controlling said phases of said transmission andreception radio waves so that all of the said nodes form one or moreclosed loops; and transfer said packet to said destination address at atime other than said certain time period in accordance with said routinginformation and a time frame assigned to each of the said nodes as atime when each said node is allowed to transmit and receive a packet,update said routing information held by each said node on the basis ofsaid packet communication records and share said updated routinginformation among said nodes after said time synchronization; wherein:said node comprises an antenna formed of a plurality of antenna elementsarranged in a certain order, phase control means for controlling saidphases of said transmission and reception radio waves of each of thesaid antenna elements, and transmission and reception means fortransmitting and receiving said packet through said transmission andreception radio waves, and said phase control means converts saiddestination address included in said packet into a phase difference of aradio wave to be applied to each of the said antenna elements includedin said transfer destination node.
 17. The computer program productaccording to claim 16, wherein performing transmission and reception ofpacket communication records further comprises said packet communicationsystem determining whether said packet communication records have beenacquired from all of the said nodes.
 18. The computer program productaccording to claim 16, wherein: said node includes an antenna formed ofa plurality of antenna elements arranged in a certain order, phasecontrol means for controlling phases of said transmission and receptionradio waves of each of the said antenna elements, and transmission andreception means for transmitting and receiving said packet through saidtransmission and reception radio waves, and transmitting and receivingsaid packets further comprises said packet communication systemconverting, by said phase control means, said destination addressincluded in said packet into a phase difference to be applied to each ofthe said antenna elements included in said transfer destination node.19. The computer program product according to claim 16, wherein: saidnode includes an antenna formed of a plurality of antenna elementsarranged in a certain order, phase control means for controlling phasesof said transmission and reception radio waves of each of the saidantenna elements, and transmission and reception means for transmittingand receiving said packet through said transmission and reception radiowaves, and transmitting and receiving said packets, after said phasecontrol means reads said destination address included in said packet andbefore reception of said packet is completed, further comprises saidpacket communication system converting, by said phase control means,said destination address included in said packet into a phase differenceto be applied to each of the said antenna elements included in saidtransfer destination node.
 20. The computer program product according toclaim 16, wherein performing transmission and reception of packetcommunication records is executed at predetermined intervals.
 21. Thecomputer program product according to claim 16, wherein performingtransmission and reception of packet communication records furthercomprises said packet communication system initiating said timesynchronization and said transmission and reception of said packetcommunication records by transferring an initiation request made by oneof the said plurality of nodes, among said other nodes sequentially fromone to another.